/*
 * Problem:
 * For the given binary tree,return a deep copy of it,
 * 对于给定的二叉树，返回它的深度复制
 * 
 * 
 * Example:
 * Given a binary tree:
 * 给定一棵二叉树：
 *      1
 *    /  \
 *   2    3
 *  / \
 * 4   5
 * return the new binary tree with same structure and same value。
 * 返回一棵拥有相同结构和相同值的新二叉树。
 *
 * Challenge:
 * Rotate in-place with O(1) extra memory.
 * 在O(1)的空间复杂度内旋转字符串
 */
package me.yobol.lintcode.easy.clonebt;

import me.yobol.lintcode.TreeNode;

/**
 *
 * @author Yobol
 */
public interface ICloneBinaryTree {
    public TreeNode cloneTree(TreeNode root);
}
